Application of Automated Deduction to the Search for Single Axioms for Exponent Groups
نویسندگان
چکیده
We present new results in axiomatic group theory obtained by using automated deduction programs. The results include single axioms, some with the identity and others without, for groups of exponents 3, 4, 5, and 7, and a general form for single axioms for groups of odd exponent. The results were obtained by using the programs in three separate ways: as a symbolic calculator, to search for proofs, and to search for counterexamples. We also touch on relations between logic programmingand automated reasoning.
منابع مشابه
The Shortest Single Axioms for Groups of Exponent 4
We study equations of the form (= x) which are single axioms for groups of exponent 4, where is a term in product only. Every such must have at least 9 variable occurrences, and there are exactly three such of this size, up to variable renaming and mirroring. These terms were found by an exhaustive search through all terms of this form. Automated techniques were used in two ways: to eliminate m...
متن کاملSingle Axioms for Boolean Algebra
Explicit single axioms are presented for Boolean algebra in terms of (1) the Sheffer stroke; (2) disjunction and negation; (3) disjunction, conjunction, and negation; and (4) disjunction, conjunction, negation, 0, and 1. It was previously known that single axioms exist for these systems, but the procedures to generate them are exponential, producing huge equations. Automated deduction technique...
متن کاملVanquishing the XCB Question: The Methodology Discovery of the Last Shortest Single Axiom for the Equivalential Calculus
With the inclusion of an effective methodology, this article answers in detail a question that, for a quarter of a century, remained open despite intense study by various researchers. Is the formula XCB = e(x, e(e(e(x, y), e(z, y)), z)) a single axiom for the classical equivalential calculus when the rules of inference consist of detachment (modus ponens) and substitution? Where the function e ...
متن کاملAn Automated Derivation of Church's P2 Sentential Calculus from Łukasiewicz's CN
Two logics are implicationally equivalent if the axioms and inference rules of each imply the axioms of the other. Characterizing equivalences of various formulations of the sentential calculi is foundational to the study of logic. Using an automated deduction system, I show that Church's P2 sentential calculus can be derived from Łukasiewicz's CN. To prove each of the axioms of P2, the deducti...
متن کاملAutomated Deduction in the B Set Theory using Typed Proof Search and Deduction Modulo
We introduce an encoding of the set theory of the B method using polymorphic types and deduction modulo, which is used for the automated verification of proof obligations in the framework of the BWare project. Deduction modulo is an extension of predicate calculus with rewriting both on terms and propositions. It is well suited for proof search in theories because it turns many axioms into rewr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992